Context-exploiting Shapes for Diagram Transformation

نویسندگان

  • Frank Drewes
  • Berthold Hoffmann
  • Mark Minas
چکیده

DIAPLAN is a language for programming with graphs representing diagrams that is currently being developed. The computational model of the languages, nested graph transformation, supports nested structuring of graphs, and graph variables, but is—hopefully—still intuitive. This paper is about structural typing of nested graphs and nested graph transformation systems by shape rules. We extend the context-free shape rules proposed in earlier work to context-exploiting shape rules by which many relevant graph structures can be specified. The conformance of a nested graph to shape rules is decidable. If a transformation system conforms to shape rules as well, it can be shown to preserve shape conformance of the graphs it is applied to. This sets up a static type discipline for nested graph transformation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Phase diagrams and shape transformations of toroidal vesicles

Shapes of vesicles with toroidal topology are studied in the context of curvature models for the membrane. For two simplified curvature models, the spontaneous-curvature (SC) model and the bilayer-couple (BC) model, the structure of energy diagrams, sheets of stationary shapes and phase diagrams are obtained by solving shape equations for axisymmetric shapes. Three different sheets of axisymmet...

متن کامل

Hand-Drawn Diagram Recognition with Hierarchical Parsing: An Experimental Evaluation

This paper presents the evaluation of a parsing strategy for the recognition of sketched diagrams. The architecture of the recognition system consists of three hierarchically arranged layers where the user’ strokes are first segmented and interpreted as primitive shapes, then by exploiting the domain context they are clustered into symbols of the domain and an interpretation of whole sentence i...

متن کامل

Shapely Hierarchical Graph Transformation

Diagrams can be represented by graphs, and the animation and transformation of diagrams can be modeled by graph transformation. This paper studies extensions of graphs and graph transformation that are important for programming with graphs: We extend graphs by a notion of hierarchy that supports value composition, and define hierarchical graph transformation in an intuitive way that resembles t...

متن کامل

Medial Surface Transformations for Rapid Approximation of Casting Solidification

This thesis demonstrates the feasibility of using a medial surface transformation as a tool to rapidly approximate the solidification patterns of convex faceted solid models of castings. The medial surface transformation is used to automate the greatest included sphere approach to solidification pattern approximation. The experimental software of this thesis extracts the medial surface transfor...

متن کامل

Vectorization with the Voronoi L-diagram

A new precision vectorization method has been developed for building centerlines of plain shapes. First a dense skeleton is computed. Centerlines are obtained as a subset of branches of the dense skeleton. The dense skeleton can also be used for obtaining medial axes of shapes. To obtain high precision, the distance transformation 12-17-38 was developed, which gives a good approximation of the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002